Generalized Baum-Welch Algorithm and its Implication to a New Extended Baum-Welch Algorithm
نویسندگان
چکیده
This paper describes how we can use the generalized BaumWelch (GBW) algorithm to develop better extended BaumWelch (EBW) algorithms. Based on GBW, we show that the backoff term in the EBW algorithm comes from KL-divergence which is used as a regularization function. This finding allows us to develop a fast EBW algorithm, which can reduce the time of model space discriminative training by half, without incurring any degradation on recognition accuracy. We compare the performance of the new EBW algorithm with the original one on various large scale systems including Farsi, Iraqi and modern standard Arabic ASR systems.
منابع مشابه
Comparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice
A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...
متن کاملGeneralized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations
The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...
متن کاملA New Family of Extended Baum-Welch Update Rules
In this paper, we consider a generalization of the state-of-art discriminative method for optimizing the conditional likelihood in Hidden Markov Models (HMMs), called the Extended Baum-Welch (EBW) algorithm, that has had significant impact on the speech recognition community. We propose a generalized form of EBW update rules that can be associated with a weighted sum of updated and initial mode...
متن کاملOptimization-Based Control for the Extended Baum-Welch Algorithm
The extended Baum-Welch (EBW) is the most popular algorithm for discriminative training of speech recognition acoustic models. The EBW algorithm is usually controlled with heuristic rules, which are used to determine the smoothing parameters of the algorithm. In this paper we propose a control method for EBW which is based on the optimization of an error measure over a small control set. The la...
متن کاملGeneralized Baum-Welch Algorithm Based on the Similarity between Sequences
The profile hidden Markov model (PHMM) is widely used to assign the protein sequences to their respective families. A major limitation of a PHMM is the assumption that given states the observations (amino acids) are independent. To overcome this limitation, the dependency between amino acids in a multiple sequence alignment (MSA) which is the representative of a PHMM can be appended to the PHMM...
متن کامل